An efficient algorithm for video sequence matching using the modified Hausdorff distance and the directed divergence
نویسندگان
چکیده
To manipulate large video database, effective video indexing and retrieval are required. A large number of video retrieval algorithms have been presented for framewise user query or video content query, whereas a few video-sequence matching algorithms have been investigated. In this paper, we propose an efficient algorithm for video sequence matching using the modified Hausdorff distance and the directed divergence of histograms between successive frames. To effectively match the video sequences with a low computational load, we use the key frames extracted by the cumulative directed divergence and compare the set of key frames using the modified Hausdorff distance. Experimental results with color video sequences show that the proposed algorithms for video sequence matching yield better performance than conventional algorithms such as histogram difference, histogram intersection, and Chi-square test methods.
منابع مشابه
Content similarity matching for video sequence identification
To manage large database system with video, effective video indexing and retrieval are required. A large number of video retrieval algorithms have been presented for frame-wise user query or video content query, whereas a few video identification algorithms have been proposed for video sequence query. In this paper, we propose an effective video identification algorithm for video sequence query...
متن کاملAn Efficient Adaptive Boundary Matching Algorithm for Video Error Concealment
Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملEfficiently comparing face images using a modified Hausdorff distance - Vision, Image and Signal Processing, IEE Proceedings-
Comparing face images using the Hausdorff distance is one of the face matching and fast screening techniques. As a fast screening technique, the computational efficiency is a key issue. An efficient method for Hausdorff distance-based face matching and fast screening is proposed. The method utilises dominant points, instead of edge maps, as features for measuring similarity. A new formulation o...
متن کاملImage Matching Using Distance Transform
Image matching is an important task. There are many available methods for occluded image matching, e.g. Hausdorff distance, Distance Transformi and wavelet decomposition based methods. We proposed Modified Chamfer Matching Algorithm (MCMA) [16], a new simple distance transform based image matching algorithm. Here we propose few more matching measures and compare them. Basic concepts relating to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Circuits Syst. Video Techn.
دوره 12 شماره
صفحات -
تاریخ انتشار 2002